On the random greedy F -free hypergraph process
نویسندگان
چکیده
منابع مشابه
On the random greedy F-free hypergraph process
Let F be a strictly k-balanced k-uniform hypergraph with e(F ) ≥ |F | − k + 1 and maximum co-degree at least two. The random greedy F -free process constructs a maximal F -free hypergraph as follows. Consider a random ordering of the hyperedges of the complete k-uniform hypergraph K n on n vertices. Start with the empty hypergraph on n vertices. Successively consider the hyperedges e of K n in ...
متن کاملA natural barrier in random greedy hypergraph matching
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D → ∞ as N → ∞ and that co-degrees of pairs of vertices in H are at most L where L = o(D/ log N). We consider the random greedy algorithm for forming a matching in H. We choose a matching at random by iteratively choosing edges uniformly at random to be in the matching and deleting all e...
متن کاملCreation and Growth of Components in a Random Hypergraph Process
Denote by an l-component a connected b-uniform hypergraph with k edges and k(b− 1)− l vertices. We prove that the expected number of creations of l-component during a random hypergraph process tends to 1 as l and b tend to ∞ with the total number of vertices n such that l = o (
متن کاملOn Random Greedy Triangle Packing
The behaviour of the random greedy algorithm for constructing a maximal packing of edgedisjoint triangles on n points (a maximal partial triple system) is analysed with particular emphasis on the final number of unused edges. It is shown that this number is at most n, “halfway” from the previous best-known upper bound o(n) to the conjectured value n. The more general problem of random greedy pa...
متن کاملThe Random Hypergraph Assignment Problem
Parisi’s famous (proven) conjecture states that the expected cost of an optimal assignment in a complete bipartite graph on n + n nodes with i. i. d. exponential edge costs with mean 1 is ∑n i=1 1/i , which converges to an asymptotic limit of π/6 as n tends to infinity. We consider a generalization of this question to complete “partitioned” bipartite hypergraphs G2,n that contain edges of size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.012